Time complexity

Results: 894



#Item
291Applied mathematics / Fibonacci heap / Heap / Scapegoat tree / Self-balancing binary search tree / Binary search tree / Treap / Fibonacci number / Time complexity / Binary trees / Theoretical computer science / Mathematics

CS 373 Homework 2 (dueSpring 1999

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:54:09
292Mathematical sciences / Polynomial / QUAD / Time complexity / Cryptanalysis / Multivariate cryptography / Cryptography / Applied mathematics / Computational complexity theory

A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae PKC 2015, March 30 - April 1, Maryland, USA

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2015-03-29 21:02:40
293Dynamic programming / Operations research / Complexity classes / Approximation algorithms / Polynomial-time approximation scheme / Knapsack problem / Subset sum problem / Parameterized complexity / Optimization problem / Theoretical computer science / Computational complexity theory / Applied mathematics

There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2010-12-30 12:50:07
294Boolean algebra / Machine learning / Bayesian statistics / Time complexity / Supervised learning / Bayesian inference / Algorithm / Boolean function / PP / Theoretical computer science / Applied mathematics / Computational complexity theory

arXiv:1403.6863v1 [cs.LG] 26 MarOnline Learning of k-CNF Boolean Functions Joel Veness Marcus Hutter

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2014-03-27 20:30:51
295Polygon / Area / Pi / Time complexity / Applied mathematics / Mathematics / Euclidean plane geometry

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Partial Matching of Planar Polygons Under Translation and Rotation Eric C. McCreath∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:04:49
296Computational complexity theory / Algorithms / Streaming algorithm / Time complexity / XTR / Ε-net / Data stream clustering / Theoretical computer science / Applied mathematics / Mathematics

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Core-Preserving Algorithms Hamid Zarrabi-Zadeh∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-29 00:09:14
297Forensic science / Heuristics / Academia / Forensic identification / Parallel computing / Time series / File system / Forensic engineering / Complexity / Science / Knowledge / Criminology

Analysis of redundant traces for consistency With examples from electronic messaging and graphical images Fred Cohen California Sciences Institute and Fred Cohen & Associates Livermore, CA 94550

Add to Reading List

Source URL: all.net

Language: English - Date: 2009-04-14 09:40:48
298Mathematics / General number field sieve / Time complexity / Integer factorization / Primality test / Algorithm / NP / Prime number / Lenstra elliptic curve factorization / Theoretical computer science / Integer factorization algorithms / Applied mathematics

Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 6th January 2012, Joint Mathematics Meetings, Boston

Add to Reading List

Source URL: web.maths.unsw.edu.au

Language: English - Date: 2012-01-11 02:12:51
299Analysis of algorithms / Computational complexity theory / Time complexity / Factorial / Mathematics / Theoretical computer science / Number theory

A Practical Approach to Approximating the Diameter of Point-set in Low Dimensions Kumar Gaurav Bijay∗ Antoine Vigneron†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:45
300Complexity classes / True quantified Boolean formula / Alternating Turing machine / FO / DTIME / NTIME / Time complexity / SL / Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics

Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract

Add to Reading List

Source URL: www.stanford.edu

Language: English - Date: 2008-04-30 19:50:48
UPDATE